New Families of Semi-Regular Relative Difference Sets

نویسندگان

  • James A. Davis
  • Jonathan Jedwab
  • Miranda Mowbray
چکیده

We give two constructions for semi-regular relative difference sets (RDSs) in groups whose order is not a prime power, where the order u of the forbidden subgroup is greater than 2. No such RDSs were previously known. We use examples from the first construction to produce semi-regular RDSs in groups whose order can contain more than two distinct prime factors. For u greater than 2 these are the first such RDSs, and for u = 2 we obtain new examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Unified Approach to Difference Sets with gcd (v,n) >1

The five known families of difference sets whose parameters (v,k,>.;n) satisfy the condition gcd(v,n) > 1 are the McFarland, Spence, Davis-Jedwab, Hadamard and Chen families. We survey recent work which ursive techniques to unify these difference set families, placing particular emphasis on examples. This unified approach has also proved useful for studying semi-regular relative difference sets...

متن کامل

$r$-fuzzy regular semi open sets in smooth topological spaces

In this paper, we introduce and study the concept of $r$-fuzzy regular semi open (closed) sets in smooth topological spaces. By using $r$-fuzzy regular semi open (closed) sets, we define a new fuzzy closure operator namely $r$-fuzzy regular semi interior (closure) operator. Also, we introduce fuzzy regular semi continuous and fuzzy regular semi irresolute mappings. Moreover, we investigate the ...

متن کامل

On some new constructions of difference sets

Difference sets are mathematical structures which arise in algebra and combinatorics, with applications in coding theory. The fundamental question is when and how one can construct difference sets. This largely expository paper looks at standard construction methods and describes recent findings that resulted in new families of difference sets. This paper provides explicit examples of differenc...

متن کامل

A Unifying Construction for Difference Sets

We present a recursive construction for difference sets which unifies the Hadamard, McFarland, and Spence parameter families and deals with all abelian groups known to contain such difference sets. The construction yields a new family of difference sets with parameters (v, k, *, n)=(2(2&1) 3, 2(2+1) 3, 2(2+1) 3, 2) for d 0. The construction establishes that a McFarland difference set exists in ...

متن کامل

A Note on New Semi-Regular Divisible Difference Sets

We give a C0051JUCtion for new families of semi-regular divisible difference sets. The construction iJ a variation of McFarland's scheme [Sl tor nonc;yclic difference SCIS. • Let G be a group of order 11111 and N a subgroup of G of order n. If D is a k-subset of G then Dis a {m, n, le , >.1, >.2) divisible difference set in G relative to N provided that the differences dd'1 fur d, d ' ED, d ;e ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1998